FDT is Undecidable for Finitely Presented Monoids with Solvable Word Problems
نویسندگان
چکیده
Exploiting a new technique for proving undecidability results developed by A. Sattler-Klein in her doctoral dissertation (1996) it is shown that it is undecidable in general whether or not a nitely presented monoid with a solvable word problem has nite derivation type (FDT). This improves upon the undecidability result of R. Cremanns and F. Otto (1996), which was based on the undecidability of the word problem for the nitely presented monoids considered.
منابع مشابه
Decidability and Independence of Conjugacy Problems in Finitely Presented Monoids
There have been several attempts to extend the notion of conjugacy from groups to monoids. The aim of this paper is study the decidability and independence of conjugacy problems for three of these notions (which we will denote by ∼p, ∼o, and ∼c) in certain classes of finitely presented monoids. We will show that in the class of polycyclic monoids, p-conjugacy is “almost” transitive, ∼c is stric...
متن کاملFp 1 Is Undecidable for Nitely Presented Monoids with Word Problems Decidable in Polynomial Time
In the rst part of this paper properties P of nitely presented monoids are considered that satisfy the following two conditions: (1) each monoid that can be presented through a nite convergent string-rewriting system has property P , and (2) each nitely presented monoid having property P is of homology type FP3. Following an idea presented in (Otto and Sattler-Klein 1997) it is shown that these...
متن کاملA Finitely Axiomatizable Undecidable Equational Theory with Recursively Solvable Word Problems
In this paper we construct a finitely based variety, whose equational theory is undecidable, yet whose word problems are recursively solvable, which solves a problem stated by G. McNulty (1992). The construction produces a discriminator variety with the aforementioned properties starting from a class of structures in some multisorted language (which may include relations), axiomatized by a fini...
متن کاملDistortion functions and the membership problem for submonoids of groups and monoids
The notion of upper distortion for graded submonoids embedded in groups and monoids is introduced. A finitely generated monoid M is graded if every element of M can be written in only finitely many ways in terms of some fixed system of generators. Examples of such monoids are free monoids, Artin monoids, and monoids satisfying certain small cancellation conditions. Whenever such a monoid is emb...
متن کاملOn the Word Problem for Tensor Products and Amalgams of Monoids
We prove that the word problem for the free product with amalgamation S U T of monoids can be undecidable, even when S and T are nitely presented monoids with word problems that are decidable in linear time, the factorization problems for U in each of S and T , as well as other problems, are decidable in polynomial time, and U is a free nitely generated unitary submonoid of both S and T. This i...
متن کامل